منابع مشابه
Random Graphs with Few Disjoint Cycles
The classical Erdős-Pósa theorem states that for each positive integer k there is an f(k) such that, in each graph G which does not have k + 1 disjoint cycles, there is a blocker of size at most f(k); that is, a set B of at most f(k) vertices such that G − B has no cycles. We show that, amongst all such graphs on vertex set {1, . . . , n}, all but an exponentially small proportion have a blocke...
متن کاملHamiltonian Colorings of Graphs with Long Cycles
By a hamiltonian coloring of a connected graph G of order n > 1 we mean a mapping c of V (G) into the set of all positive integers such that |c(x) − c(y)| > n − 1 − DG(x, y) (where DG(x, y) denotes the length of a longest x − y path in G) for all distinct x, y ∈ G. In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of or...
متن کاملLong Cycles in Hamiltonian Graphs
We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.
متن کاملSmall Cycles in Hamiltonian Graphs
We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).
متن کاملHamiltonian Cycles in Sparse Graphs
Hamiltonian Cycles in Sparse Graphs Alexander Hertel Master of Science Graduate Department of Computer Science University of Toronto 2004 The subject of this thesis is the Hamiltonian Cycle problem, which is of interest in many areas including graph theory, algorithm design, and computational complexity. Named after the famous Irish mathematician Sir William Rowan Hamilton, a Hamiltonian Cycle ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2019
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3465